<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>popot-2.01: /opt/GoogleCode/popot/trunk/popot-2.01/src/topology.h Source File</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />

<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>

</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">popot-2.01
   
   </div>
   
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.7.5 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li><a href="examples.html"><span>Examples</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
<div class="header">
  <div class="headertitle">
<div class="title">/opt/GoogleCode/popot/trunk/popot-2.01/src/topology.h</div>  </div>
</div>
<div class="contents">
<a href="topology_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="preprocessor">#ifndef POPOT_TOPOLOGY_H</span>
<a name="l00002"></a>00002 <span class="preprocessor"></span><span class="preprocessor">#define POPOT_TOPOLOGY_H</span>
<a name="l00003"></a>00003 <span class="preprocessor"></span>
<a name="l00004"></a>00004 <span class="preprocessor">#include &lt;vector&gt;</span>
<a name="l00005"></a>00005 <span class="preprocessor">#include &lt;map&gt;</span>
<a name="l00006"></a>00006 <span class="preprocessor">#include &quot;<a class="code" href="neighborhood_8h.html">neighborhood.h</a>&quot;</span>
<a name="l00007"></a>00007 
<a name="l00008"></a>00008 <span class="comment">// Define a connection matrix </span>
<a name="l00009"></a>00009 <span class="comment">// and make a generic method which takes this connection matrix;</span>
<a name="l00010"></a>00010 <span class="comment">// and fills in the neighborhoods</span>
<a name="l00011"></a>00011 
<a name="l00012"></a>00012 <span class="keyword">namespace </span>popot
<a name="l00013"></a>00013 {
<a name="l00014"></a>00014   <span class="keyword">namespace </span>PSO
<a name="l00015"></a>00015   {
<a name="l00016"></a><a class="code" href="namespacepopot_1_1PSO_1_1topology.html">00016</a>     <span class="keyword">namespace </span>topology
<a name="l00017"></a>00017     {
<a name="l00018"></a>00018 
<a name="l00024"></a>00024       <span class="keyword">template</span>&lt;<span class="keyword">typename</span> PARTICLE&gt;
<a name="l00025"></a><a class="code" href="namespacepopot_1_1PSO_1_1topology.html#a1e044578bdbe73eb92ee0062e7c38048">00025</a>       <span class="keywordtype">void</span> <a class="code" href="namespacepopot_1_1PSO_1_1topology.html#a1e044578bdbe73eb92ee0062e7c38048">connectParticles</a>(std::vector&lt;PARTICLE&gt;&amp; particles,
<a name="l00026"></a>00026                             std::map&lt; <span class="keywordtype">size_t</span>, std::vector&lt;size_t&gt; &gt; &amp;neighbordhood_membership,
<a name="l00027"></a>00027                             <span class="keywordtype">bool</span> * who_informs_whom)
<a name="l00028"></a>00028       {
<a name="l00029"></a>00029         <span class="keywordtype">size_t</span> size = particles.size();
<a name="l00030"></a>00030 
<a name="l00031"></a>00031         <span class="comment">// Just clean up the neighborhood memberships</span>
<a name="l00032"></a>00032         <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0 ; i &lt; size ; ++i)
<a name="l00033"></a>00033           neighbordhood_membership[i].clear();
<a name="l00034"></a>00034 
<a name="l00035"></a>00035 
<a name="l00036"></a>00036 
<a name="l00037"></a>00037         <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> j = 0 ; j &lt; size ; ++j)
<a name="l00038"></a>00038           {
<a name="l00039"></a>00039             particles[j].getNeighborhood().clear();
<a name="l00040"></a>00040 
<a name="l00041"></a>00041             <span class="comment">// We browse column j of who_informs_whom</span>
<a name="l00042"></a>00042             <span class="comment">// if 1.0, then we add particle i to the neighborhood of particle j</span>
<a name="l00043"></a>00043             <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0 ; i &lt; size ; ++i)
<a name="l00044"></a>00044               <span class="comment">// If particle i informs particle j</span>
<a name="l00045"></a>00045               <span class="keywordflow">if</span>(who_informs_whom[i*size + j])
<a name="l00046"></a>00046                 {
<a name="l00047"></a>00047                   <span class="comment">// Particle i belongs to the neighborhood of particle j</span>
<a name="l00048"></a>00048                   neighbordhood_membership[i].push_back(j);
<a name="l00049"></a>00049                   <span class="comment">// And we add particle i to the neighborhood of particle j</span>
<a name="l00050"></a>00050                   particles[j].getNeighborhood().add(&amp;(particles[i]));
<a name="l00051"></a>00051                 }
<a name="l00052"></a>00052           }
<a name="l00053"></a>00053       }
<a name="l00054"></a>00054 
<a name="l00055"></a>00055       <span class="keyword">template</span>&lt;<span class="keyword">typename</span> PARTICLE&gt;
<a name="l00056"></a><a class="code" href="namespacepopot_1_1PSO_1_1topology.html#a0be7a9e65cb36597c8ed6c477adc9d8d">00056</a>       <span class="keywordtype">void</span> <a class="code" href="namespacepopot_1_1PSO_1_1topology.html#a0be7a9e65cb36597c8ed6c477adc9d8d">getNeighborhoodList</a>(std::vector&lt;PARTICLE&gt;&amp; particles,
<a name="l00057"></a>00057                                std::vector&lt; typename PARTICLE::NeighborhoodType *&gt; &amp;neighborhoods)
<a name="l00058"></a>00058       {
<a name="l00059"></a>00059         neighborhoods.clear();
<a name="l00060"></a>00060         <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0 ; i &lt; particles.size() ; ++i)
<a name="l00061"></a>00061           neighborhoods.push_back(&amp;(particles[i].getNeighborhood()));
<a name="l00062"></a>00062       }
<a name="l00063"></a>00063 
<a name="l00068"></a>00068       <span class="keyword">template</span>&lt;<span class="keyword">typename</span> PARTICLE, <span class="keywordtype">bool</span> <span class="keywordtype">SEL</span>F&gt;
<a name="l00069"></a><a class="code" href="namespacepopot_1_1PSO_1_1topology.html#addd5c8fe7edb35d487fdae13ef0e13c7">00069</a>       <span class="keywordtype">void</span> <a class="code" href="namespacepopot_1_1PSO_1_1topology.html#addd5c8fe7edb35d487fdae13ef0e13c7" title="Each of the N particles receives information from the N others.">full_fillNeighborhoods</a>(std::vector&lt;PARTICLE&gt; &amp;particles,
<a name="l00070"></a>00070                                   std::vector&lt; typename PARTICLE::NeighborhoodType *&gt; &amp;neighborhoods,
<a name="l00071"></a>00071                                   std::map&lt; <span class="keywordtype">size_t</span>, std::vector&lt;size_t&gt; &gt; &amp;neighbordhood_membership)
<a name="l00072"></a>00072       {
<a name="l00073"></a>00073         <span class="keywordtype">size_t</span> size = particles.size();
<a name="l00074"></a>00074 
<a name="l00075"></a>00075         <span class="comment">// Generate the connection matrix</span>
<a name="l00076"></a>00076         <span class="comment">// Column j indicates which particle informs particle j</span>
<a name="l00077"></a>00077         <span class="comment">// therefore, line i indicates which particles the particle i informs</span>
<a name="l00078"></a>00078         <span class="keywordtype">bool</span> *who_informs_whom = <span class="keyword">new</span> <span class="keywordtype">bool</span>[size * size];
<a name="l00079"></a>00079 
<a name="l00080"></a>00080         memset(who_informs_whom, <span class="keyword">true</span>, size*size*<span class="keyword">sizeof</span>(<span class="keywordtype">bool</span>));
<a name="l00081"></a>00081 
<a name="l00082"></a>00082         <span class="keywordflow">if</span>(!SELF)
<a name="l00083"></a>00083           <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0 ; i &lt; size ; ++i)
<a name="l00084"></a>00084             who_informs_whom[i*size + i] = <span class="keyword">false</span>;
<a name="l00085"></a>00085 
<a name="l00086"></a>00086         <span class="comment">// Given the connectivity matrix, we now connect the particles</span>
<a name="l00087"></a>00087         <a class="code" href="namespacepopot_1_1PSO_1_1topology.html#a0be7a9e65cb36597c8ed6c477adc9d8d">getNeighborhoodList</a>(particles, neighborhoods);
<a name="l00088"></a>00088         <a class="code" href="namespacepopot_1_1PSO_1_1topology.html#a1e044578bdbe73eb92ee0062e7c38048">connectParticles</a>(particles, neighbordhood_membership, who_informs_whom);
<a name="l00089"></a>00089           
<a name="l00090"></a>00090         <span class="keyword">delete</span>[] who_informs_whom;
<a name="l00091"></a>00091       }
<a name="l00092"></a>00092 
<a name="l00097"></a>00097       <span class="keyword">template</span>&lt;<span class="keyword">typename</span> PARTICLE, <span class="keywordtype">bool</span> <span class="keywordtype">SEL</span>F&gt;
<a name="l00098"></a><a class="code" href="namespacepopot_1_1PSO_1_1topology.html#a837b692442aa5291538ae2797c728f55">00098</a>       <span class="keywordtype">void</span> <a class="code" href="namespacepopot_1_1PSO_1_1topology.html#a837b692442aa5291538ae2797c728f55" title="A ring topology connects the particles on a ring plus a connection to itself.">ring_fillNeighborhoods</a>(std::vector&lt;PARTICLE&gt;&amp; particles,
<a name="l00099"></a>00099                                   std::vector&lt; typename PARTICLE::NeighborhoodType *&gt; &amp;neighborhoods,
<a name="l00100"></a>00100                                   std::map&lt; <span class="keywordtype">size_t</span>, std::vector&lt;size_t&gt; &gt; &amp;neighbordhood_membership)
<a name="l00101"></a>00101         {
<a name="l00102"></a>00102           <span class="keywordtype">size_t</span> size = particles.size();
<a name="l00103"></a>00103           
<a name="l00104"></a>00104           <span class="comment">// Generate the connection matrix</span>
<a name="l00105"></a>00105           <span class="comment">// Column j indicates which particle informs particle j</span>
<a name="l00106"></a>00106           <span class="comment">// therefore, line i indicates which particles the particle i informs</span>
<a name="l00107"></a>00107           <span class="keywordtype">bool</span> *who_informs_whom = <span class="keyword">new</span> <span class="keywordtype">bool</span>[size * size];
<a name="l00108"></a>00108 
<a name="l00109"></a>00109           <span class="comment">// Set the connection matrix to False everywhere</span>
<a name="l00110"></a>00110           memset(who_informs_whom, <span class="keyword">false</span>, size*size*<span class="keyword">sizeof</span>(<span class="keywordtype">bool</span>));
<a name="l00111"></a>00111 
<a name="l00112"></a>00112           <span class="keywordtype">size_t</span> i_neigh;
<a name="l00113"></a>00113           <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0 ; i &lt; size ; ++i)
<a name="l00114"></a>00114             {
<a name="l00115"></a>00115               <span class="comment">// Particle i is informed by the particle on the left and the particle on its right</span>
<a name="l00116"></a>00116               <span class="keywordflow">if</span>(i == size - 1)
<a name="l00117"></a>00117                 i_neigh = 0;
<a name="l00118"></a>00118               <span class="keywordflow">else</span>
<a name="l00119"></a>00119                 i_neigh = i + 1;
<a name="l00120"></a>00120               who_informs_whom[i_neigh*size + i] = <span class="keyword">true</span>;
<a name="l00121"></a>00121 
<a name="l00122"></a>00122               <span class="keywordflow">if</span>(i == 0)
<a name="l00123"></a>00123                 i_neigh = size-1;
<a name="l00124"></a>00124               <span class="keywordflow">else</span>
<a name="l00125"></a>00125                 i_neigh = i - 1;
<a name="l00126"></a>00126               who_informs_whom[i_neigh*size + i] = <span class="keyword">true</span>;
<a name="l00127"></a>00127 
<a name="l00128"></a>00128               <span class="keywordflow">if</span>(SELF)
<a name="l00129"></a>00129                 who_informs_whom[i*size + i] = <span class="keyword">true</span>;
<a name="l00130"></a>00130             }
<a name="l00131"></a>00131 
<a name="l00132"></a>00132           <span class="comment">// Given the connectivity matrix, we now connect the particles</span>
<a name="l00133"></a>00133           getNeighborhoodList&lt;PARTICLE&gt;(particles, neighborhoods);
<a name="l00134"></a>00134           connectParticles&lt;PARTICLE&gt;(particles, neighbordhood_membership, who_informs_whom);
<a name="l00135"></a>00135 
<a name="l00136"></a>00136           <span class="keyword">delete</span>[] who_informs_whom;
<a name="l00137"></a>00137         }
<a name="l00138"></a>00138         
<a name="l00139"></a>00139 
<a name="l00145"></a>00145       <span class="keyword">template</span>&lt;<span class="keyword">typename</span> PARTICLE, <span class="keywordtype">bool</span> <span class="keywordtype">SEL</span>F&gt;
<a name="l00146"></a><a class="code" href="namespacepopot_1_1PSO_1_1topology.html#aae9a2e55ed77c1cef1a2b34bd4f4d8ee">00146</a>       <span class="keywordtype">void</span> <a class="code" href="namespacepopot_1_1PSO_1_1topology.html#aae9a2e55ed77c1cef1a2b34bd4f4d8ee" title="The von Neuman topology connects the particles on a 2D toric grid with the nearest four neighbours pl...">vonNeuman_fillNeighborhoods</a>(std::vector&lt;PARTICLE&gt;&amp; particles,
<a name="l00147"></a>00147                                        std::vector&lt; typename PARTICLE::NeighborhoodType *&gt; &amp;neighborhoods,
<a name="l00148"></a>00148                                        std::map&lt; <span class="keywordtype">size_t</span>, std::vector&lt;size_t&gt; &gt; &amp;neighbordhood_membership)
<a name="l00149"></a>00149       {
<a name="l00150"></a>00150         <span class="keywordtype">size_t</span> size = particles.size();
<a name="l00151"></a>00151         <span class="keywordtype">size_t</span> width = size_t(sqrt(size));
<a name="l00152"></a>00152         <span class="keywordtype">size_t</span> height= size_t(size / width);
<a name="l00153"></a>00153 
<a name="l00154"></a>00154         <span class="keywordflow">if</span>(height * width != size)
<a name="l00155"></a>00155           {
<a name="l00156"></a>00156             std::cout &lt;&lt; <span class="stringliteral">&quot;WARNING : I was only able to set up a grid of &quot;</span> &lt;&lt; height &lt;&lt; <span class="stringliteral">&quot; x &quot;</span> &lt;&lt; width &lt;&lt; <span class="stringliteral">&quot;, not including all the &quot;</span> &lt;&lt; size &lt;&lt; <span class="stringliteral">&quot; particles &quot;</span> &lt;&lt; std::endl;
<a name="l00157"></a>00157             std::cout &lt;&lt; <span class="stringliteral">&quot; this will fail ;) &quot;</span> &lt;&lt; std::endl;
<a name="l00158"></a>00158             
<a name="l00159"></a>00159           }
<a name="l00160"></a>00160 
<a name="l00161"></a>00161         <span class="comment">// Generate the connection matrix</span>
<a name="l00162"></a>00162         <span class="keywordtype">bool</span> *who_informs_whom = <span class="keyword">new</span> <span class="keywordtype">bool</span>[size * size];
<a name="l00163"></a>00163 
<a name="l00164"></a>00164         <span class="comment">// Column j indicates which particle informs particle j</span>
<a name="l00165"></a>00165         <span class="comment">// therefore, line i indicates which particles the particle i informs</span>
<a name="l00166"></a>00166 
<a name="l00167"></a>00167         <span class="comment">// Set the connection matrix to 0 everywhere</span>
<a name="l00168"></a>00168         <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0 ; i &lt; size * size ; ++i)
<a name="l00169"></a>00169           who_informs_whom[i] = <span class="keyword">false</span>;
<a name="l00170"></a>00170 
<a name="l00171"></a>00171         <span class="keywordtype">size_t</span> i_neigh, j_neigh;
<a name="l00172"></a>00172         <span class="keywordtype">size_t</span> index_part, index_neigh;
<a name="l00173"></a>00173         <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0 ; i &lt; height ; ++i)
<a name="l00174"></a>00174           {
<a name="l00175"></a>00175             <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> j = 0 ; j &lt; width ; ++j)
<a name="l00176"></a>00176               {
<a name="l00177"></a>00177 
<a name="l00178"></a>00178                 index_part = i*width + j;
<a name="l00179"></a>00179 
<a name="l00180"></a>00180                 <span class="comment">// Add the 4 closest neighboors that are informing particle index_part</span>
<a name="l00181"></a>00181                 <span class="keywordflow">if</span>(i == 0)
<a name="l00182"></a>00182                   i_neigh = height - 1;
<a name="l00183"></a>00183                 <span class="keywordflow">else</span>
<a name="l00184"></a>00184                   i_neigh = i - 1;
<a name="l00185"></a>00185                 j_neigh = j;
<a name="l00186"></a>00186 
<a name="l00187"></a>00187                 index_neigh = i_neigh * width + j_neigh;
<a name="l00188"></a>00188                 who_informs_whom[index_neigh*size + index_part] = <span class="keyword">true</span>;
<a name="l00189"></a>00189 
<a name="l00190"></a>00190                 <span class="keywordflow">if</span>(i == height - 1)
<a name="l00191"></a>00191                   i_neigh = 0;
<a name="l00192"></a>00192                 <span class="keywordflow">else</span>
<a name="l00193"></a>00193                   i_neigh = i + 1;
<a name="l00194"></a>00194                 j_neigh = j;
<a name="l00195"></a>00195 
<a name="l00196"></a>00196                 index_neigh = i_neigh * width + j_neigh;
<a name="l00197"></a>00197                 who_informs_whom[index_neigh*size + index_part] = <span class="keyword">true</span>;
<a name="l00198"></a>00198 
<a name="l00199"></a>00199                 i_neigh = i;
<a name="l00200"></a>00200                 <span class="keywordflow">if</span>(j == 0)
<a name="l00201"></a>00201                   j_neigh = width - 1;
<a name="l00202"></a>00202                 <span class="keywordflow">else</span>
<a name="l00203"></a>00203                   j_neigh = j - 1;
<a name="l00204"></a>00204 
<a name="l00205"></a>00205                 index_neigh = i_neigh * width + j_neigh;
<a name="l00206"></a>00206                 who_informs_whom[index_neigh*size + index_part] = <span class="keyword">true</span>;
<a name="l00207"></a>00207 
<a name="l00208"></a>00208                 i_neigh = i;
<a name="l00209"></a>00209                 <span class="keywordflow">if</span>(j_neigh == width - 1)
<a name="l00210"></a>00210                   j_neigh = 0;
<a name="l00211"></a>00211                 <span class="keywordflow">else</span>
<a name="l00212"></a>00212                   j_neigh = j + 1;
<a name="l00213"></a>00213 
<a name="l00214"></a>00214                 index_neigh = i_neigh * width + j_neigh;
<a name="l00215"></a>00215                 who_informs_whom[index_neigh*size + index_part] = <span class="keyword">true</span>;
<a name="l00216"></a>00216 
<a name="l00217"></a>00217                 <span class="keywordflow">if</span>(SELF)
<a name="l00218"></a>00218                   who_informs_whom[i*size + i] = <span class="keyword">true</span>;
<a name="l00219"></a>00219               }
<a name="l00220"></a>00220           }
<a name="l00221"></a>00221         
<a name="l00222"></a>00222         <span class="comment">// Given the connectivity matrix, we now connect the particles</span>
<a name="l00223"></a>00223         getNeighborhoodList&lt;PARTICLE&gt;(particles, neighborhoods);
<a name="l00224"></a>00224         connectParticles&lt;PARTICLE&gt;(particles, neighbordhood_membership, who_informs_whom);
<a name="l00225"></a>00225 
<a name="l00226"></a>00226         <span class="keyword">delete</span>[] who_informs_whom;
<a name="l00227"></a>00227       }
<a name="l00228"></a>00228 
<a name="l00229"></a>00229 
<a name="l00230"></a>00230 
<a name="l00235"></a>00235       <span class="keyword">template</span>&lt;<span class="keyword">typename</span> PARTICLE, <span class="keywordtype">int</span> K, <span class="keywordtype">bool</span> <span class="keywordtype">SEL</span>F&gt;
<a name="l00236"></a><a class="code" href="namespacepopot_1_1PSO_1_1topology.html#aa61407e5352137f1eccb5226bb4d6f58">00236</a>       <span class="keywordtype">void</span> <a class="code" href="namespacepopot_1_1PSO_1_1topology.html#aa61407e5352137f1eccb5226bb4d6f58" title="Some probabilistic connectivity so that most of the particles will have K informants.">randomInformants_fillNeighborhoods</a>(std::vector&lt;PARTICLE&gt;&amp; particles,
<a name="l00237"></a>00237                                               std::vector&lt; typename PARTICLE::NeighborhoodType *&gt;&amp; neighborhoods,
<a name="l00238"></a>00238                                               std::map&lt; <span class="keywordtype">size_t</span>, std::vector&lt;size_t&gt; &gt;&amp; neighbordhood_membership)
<a name="l00239"></a>00239         {
<a name="l00240"></a>00240 
<a name="l00241"></a>00241           <span class="keywordtype">size_t</span> size = particles.size();
<a name="l00242"></a>00242 
<a name="l00243"></a>00243           <span class="comment">// Generate the connection matrix</span>
<a name="l00244"></a>00244           <span class="comment">// Column j indicates which particle informs particle j</span>
<a name="l00245"></a>00245           <span class="comment">// therefore, line i indicates which particles the particle i informs</span>
<a name="l00246"></a>00246           <span class="keywordtype">bool</span> *who_informs_whom = <span class="keyword">new</span> <span class="keywordtype">bool</span>[size * size];
<a name="l00247"></a>00247 
<a name="l00248"></a>00248           <span class="comment">// Set the connection matrix to 0 everywhere</span>
<a name="l00249"></a>00249           <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0 ; i &lt; size*size ; ++i)
<a name="l00250"></a>00250             who_informs_whom[i] = <span class="keyword">false</span>;
<a name="l00251"></a>00251 
<a name="l00252"></a>00252           <span class="comment">// A particle informs itself</span>
<a name="l00253"></a>00253           <span class="keywordflow">if</span>(SELF)
<a name="l00254"></a>00254             <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0 ; i &lt; size ; ++i)
<a name="l00255"></a>00255               who_informs_whom[i*size + i] = <span class="keyword">true</span>;
<a name="l00256"></a>00256 
<a name="l00257"></a>00257           <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0 ; i &lt; size ; ++i)
<a name="l00258"></a>00258             {
<a name="l00259"></a>00259               <span class="comment">// For line i, we draw uniformely with replacement K-1 particles this particle will inform</span>
<a name="l00260"></a>00260               <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> k = 0 ; k &lt; K-1 ; ++k)
<a name="l00261"></a>00261                 who_informs_whom[i*size + (<span class="keywordtype">size_t</span>)<a class="code" href="namespacepopot_1_1math.html#aa928311374a0ce22928a61a324b53fac">popot::math::uniform_integer</a>(0, size-1)] = <span class="keyword">true</span>;
<a name="l00262"></a>00262             }
<a name="l00263"></a>00263 
<a name="l00264"></a>00264           <span class="comment">// Given the connectivity matrix, we now connect the particles</span>
<a name="l00265"></a>00265           getNeighborhoodList&lt;PARTICLE&gt;(particles, neighborhoods);
<a name="l00266"></a>00266           connectParticles&lt;PARTICLE&gt;(particles, neighbordhood_membership, who_informs_whom);
<a name="l00267"></a>00267 
<a name="l00268"></a>00268           <span class="keyword">delete</span>[] who_informs_whom;
<a name="l00269"></a>00269         }
<a name="l00270"></a>00270 
<a name="l00275"></a>00275       <span class="keyword">template</span>&lt;<span class="keyword">typename</span> PARTICLE, <span class="keywordtype">int</span> K, <span class="keywordtype">bool</span> <span class="keywordtype">SEL</span>F&gt;
<a name="l00276"></a><a class="code" href="namespacepopot_1_1PSO_1_1topology.html#af9b65650ff08d7b8fd57555668a8f78c">00276</a>       <span class="keywordtype">void</span> <a class="code" href="namespacepopot_1_1PSO_1_1topology.html#af9b65650ff08d7b8fd57555668a8f78c" title="Some probabilistic connectivity so that most of the particles will have K informants.">adaptiveRandom_fillNeighborhoods</a>(std::vector&lt;PARTICLE&gt;&amp; particles,
<a name="l00277"></a>00277                                std::vector&lt; typename PARTICLE::NeighborhoodType *&gt; &amp;neighborhoods,
<a name="l00278"></a>00278                              std::map&lt; <span class="keywordtype">size_t</span>, std::vector&lt;size_t&gt; &gt; &amp;neighbordhood_membership)
<a name="l00279"></a>00279         {
<a name="l00280"></a>00280           <span class="keywordtype">size_t</span> size = particles.size();
<a name="l00281"></a>00281 
<a name="l00282"></a>00282           <span class="keywordtype">double</span> p = 1.0 - pow(1.0 - 1.0/size,K);
<a name="l00283"></a>00283 
<a name="l00284"></a>00284           <span class="comment">// Generate the connection matrix</span>
<a name="l00285"></a>00285           <span class="comment">// Column j indicates which particle informs particle j</span>
<a name="l00286"></a>00286           <span class="comment">// therefore, line i indicates which particles the particle i informs</span>
<a name="l00287"></a>00287           <span class="keywordtype">bool</span> *who_informs_whom = <span class="keyword">new</span> <span class="keywordtype">bool</span>[size * size];
<a name="l00288"></a>00288           memset(who_informs_whom, <span class="keyword">false</span>, size * size * <span class="keyword">sizeof</span>(<span class="keywordtype">bool</span>));
<a name="l00289"></a>00289 
<a name="l00290"></a>00290           <span class="comment">// A particle informs itself</span>
<a name="l00291"></a>00291           <span class="keywordflow">if</span>(SELF)
<a name="l00292"></a>00292             <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0 ; i &lt; size ; ++i)
<a name="l00293"></a>00293               who_informs_whom[i*size + i] = <span class="keyword">true</span>;
<a name="l00294"></a>00294 
<a name="l00295"></a>00295           <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0 ; i &lt; size ; ++i)
<a name="l00296"></a>00296             {
<a name="l00297"></a>00297               <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> k = 0 ; k &lt; size ; ++k)
<a name="l00298"></a>00298                 <span class="keywordflow">if</span>(k != i)
<a name="l00299"></a>00299                   {
<a name="l00300"></a>00300                     <span class="keywordflow">if</span>(<a class="code" href="namespacepopot_1_1math.html#aff66c3835eec2f4653b273e25e8c841b">popot::math::uniform_random</a>(0.0,1.0) &lt; p)
<a name="l00301"></a>00301                       who_informs_whom[k*size + i] = <span class="keyword">true</span>; <span class="comment">// k informs i</span>
<a name="l00302"></a>00302                     <span class="keywordflow">else</span>
<a name="l00303"></a>00303                       who_informs_whom[k*size + i] = <span class="keyword">false</span>;
<a name="l00304"></a>00304                   }
<a name="l00305"></a>00305             }
<a name="l00306"></a>00306 
<a name="l00307"></a>00307           <span class="comment">// Given the connectivity matrix, we now connect the particles</span>
<a name="l00308"></a>00308           getNeighborhoodList&lt;PARTICLE&gt;(particles, neighborhoods);
<a name="l00309"></a>00309           connectParticles&lt;PARTICLE&gt;(particles, neighbordhood_membership, who_informs_whom);
<a name="l00310"></a>00310 
<a name="l00311"></a>00311           <span class="keyword">delete</span>[] who_informs_whom;
<a name="l00312"></a>00312         }
<a name="l00313"></a>00313 
<a name="l00314"></a>00314 
<a name="l00315"></a>00315 
<a name="l00316"></a>00316     } <span class="comment">// topology</span>
<a name="l00317"></a>00317   } <span class="comment">// PSO</span>
<a name="l00318"></a>00318 } <span class="comment">// popot</span>
<a name="l00319"></a>00319 
<a name="l00320"></a>00320 <span class="preprocessor">#endif // POPOT_TOPOLOGY_H</span>
</pre></div></div>
</div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark">&#160;</span>Defines</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>



<hr class="footer"/><address class="footer"><small>
Generated by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.7.5
</small></address>

</body>
</html>
